A multi-point Metropolis scheme with generic weight functions
نویسندگان
چکیده
منابع مشابه
Simulated Overloading using Generic Functions in Scheme
This paper investigates using generic routines, as provided in the language EL1, to simulate overloading in the dynamically-typed, functional programming language Scheme. Overloading improves the possibilities for code reuse and advocates an incremental style of programming. An extension is described which provides both explicit and inference mechanisms for describing the domain of an overloade...
متن کاملMetropolis and Symmetric Functions: A Swan Song
The class of symmetric functions is based on the OneMax function by a subsequent assigning application of a real valued function. In this work we derive a sharp boundary between those problem instances that are solvable in polynomial time by the Metropolis algorithm and those that need at least exponential time. This result is both proven theoretically and illustrated by experimental data. The ...
متن کاملMulti-point Taylor Expansions of Analytic Functions
Abstract. Taylor expansions of analytic functions are considered with respect to several points, allowing confluence of any of them. Cauchy-type formulas are given for coefficients and remainders in the expansions, and the regions of convergence are indicated. It is explained how these expansions can be used in deriving uniform asymptotic expansions of integrals. The method is also used for obt...
متن کاملA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
In order to improve the flexibility of curves, a new five-point binary approximating subdivision scheme with two parameters is presented. The generating polynomial method is used to investigate the uniform convergence and Ck-continuity of this scheme. In a special case, the five-point scheme changes into a four-point scheme, which can generate C3 limit curves. The shape-preserving properties of...
متن کاملOn a Multi-point Interpolation Problem for Generalized Schur Functions
The nondegenerate Nevanlinna-Pick-Carathéodory-Fejer interpolation problem with finitely many interpolation conditions always has infinitely many solutions in a generalized Schur class Sκ for every κ ≥ κmin where the integer κmin equals the number of negative eigenvalues of the Pick matrix associated to the problem and completely determined by interpolation data. A linear fractional description...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2012
ISSN: 0167-7152
DOI: 10.1016/j.spl.2012.04.008